The merit factor of binary sequences related to difference sets
نویسندگان
چکیده
Long binary sequences related to cyclic difference sets are investigated. Among all known constructions of cyclic difference sets we show that only sequences constructed from Hadamard difference sets can have an asymptotic nonzero merit factor. Maximal length shift register sequences, Legendre, and twin-prime sequences are all constructed from Hadamard difference sets. We prove that the asymptotic merit factor of any maximal length shift register sequence is three. For twin-prime sequences it is shown that the best asymptotic merit factor is six. This value is obtained by shifting the twin-prime sequence one quarter of its length. It turns out that Legendre sequences and twin-prime sequences have similar behavior. Based on the Jacobi symbol we investigate Jacobi sequences. The best asymptotic merit factor is shown to be six. Through the introduction of product sequences, it is argued that the maximal merit factor among all sequences of length N is at least six when N is large. We also demonstrate that it is fairly easy to construct sequences of moderate composite length with merit factor close to six. Index Terms -Sequences, correlation, cyclic difference sets.
منابع مشابه
The merit factor of binary sequence families constructed from m-sequences
We consider the asymptotic merit factor of two binary sequence families obtained from an initial binary sequence family using a “negaperiodic” and a “periodic” construction. When the initial sequences are m-sequences, both of the constructed families have the same asymptotic merit factor as the initial family, at all rotations of sequence elements. A similar property was previously shown to hol...
متن کاملAppended m-Sequences with Merit Factor Greater than 3.34
We consider the merit factor of binary sequences obtained by appending an initial fraction of an m-sequence to itself. We show that, for all sufficiently large n, there is some rotation of each m-sequence of length n that has merit factor greater than 3.34 under suitable appending. This is the first proof that the asymptotic merit factor of a binary sequence family can be increased under append...
متن کاملConstruction of New Asymptotic Classes of Binary Sequences Based on Existing Asymptotic Classes
In this paper, we first demonstrate on optimally shifted Legendre sequences that an addition of a ±1 to the front of all binary sequences belonging to that class does not change the asymptotic value of the aperiodic merit factor. We then extend this result to a general case, showing that concatenation of a ±1 to the front of all sequences belonging to any asymptotic class does not affect the as...
متن کاملTwo binary sequence families with large merit factor
We calculate the asymptotic merit factor, under all rotations of sequence elements, of two families of binary sequences derived from Legendre sequences. The rotation is negaperiodic for the first family, and periodic for the second family. In both cases the maximum asymptotic merit factor is 6. As a consequence, we obtain the first two families of skew-symmetric sequences with known asymptotic ...
متن کاملAdvances in the merit factor problem for binary sequences
The identification of binary sequences with large merit factor (small mean-squared aperiodic autocorrelation) is an old problem of complex analysis and combinatorial optimization, with practical importance in digital communications engineering and condensed matter physics. We establish the asymptotic merit factor of several families of binary sequences and thereby prove various conjectures, exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 37 شماره
صفحات -
تاریخ انتشار 1991